Parallel Array Classes and Lightweight Sharing Mechanisms
نویسندگان
چکیده
منابع مشابه
Parallel Array Classes and Lightweight Sharing Mechanisms
We discuss a set of parallel array classes, MetaMP, for distributed-memory architectures. The classes are implemented in C++ and interface to the PVM or Intel NX message-passing systems. An array. class implements a partitioned array as a set of objects distributed across the nodes a *collectiven object. Object methods hide the low-level message-passing and implement meaningful array operations...
متن کاملInformation Sharing Mechanisms in Parallel Programs
Most parallel programming models provide a single generic mode in which processes can exchange information with each other. However, empirical observation of parallel programs suggest that processes share data in a few distinct and speciic modes. We argue that such modes should be identiied and explicitly supported in parallel languages and their associated models. The paper describes a set of ...
متن کاملLightweight Parameterized Suffix Array Construction
We present a first algorithm for direct construction of parameterized suffix arrays and parameterized longest common prefix arrays for non-binary strings. Experimental results show that our algorithm is much faster than näıve methods.
متن کاملFast Lightweight Suffix Array Construction and Checking
We describe an algorithm that, for any v ∈ [2, n], constructs the suffix array of a string of length n in O(vn+ n logn) time using O(v + n/√v) space in addition to the input (the string) and the output (the suffix array). By setting v = log n, we obtain an O(n logn) time algorithm using O(n/√logn) extra space. This solves the open problem stated by Manzini and Ferragina [ESA ’02] of whether the...
متن کاملFast and Lightweight LCP-Array Construction Algorithms
The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, the LCP-array, and data structures for simulating navigational operations on the suffix tree. The LCP-array stores the leng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 1993
ISSN: 1058-9244,1875-919X
DOI: 10.1155/1993/393409